The G-biliaison class of symmetric determinantal schemes
نویسندگان
چکیده
منابع مشابه
The G-biliaison Class of Symmetric Determinantal Schemes
We consider a family of schemes, that are defined by minors of a homogeneous symmetric matrix with polynomial entries. We assume that they have maximal possible codimension, given the size of the matrix and of the minors that define them. We show that these schemes are G-bilinked to a linear variety of the same dimension. In particular, they can be obtained from a linear variety by a finite seq...
متن کاملSymmetric Ladders and G-biliaison
We study the family of ideals generated by minors of mixed size contained in a ladder of a symmetric matrix from the point of view of liaison theory. We prove that they can be obtained from ideals of linear forms by ascending G-biliaison. In particular, they are glicci.
متن کاملG-biliaison of Ladder Pfaffian Varieties
The ideals generated by pfaffians of mixed size contained in a subladder of a skew-symmetric matrix of indeterminates define arithmetically Cohen-Macaulay, projectively normal, reduced and irreducible projective varieties. We show that these varieties belong to the G-biliaison class of a complete intersection. In particular, they are glicci.
متن کاملNon-symmetric 3-class association schemes
There are 24 feasible parameter sets for a primitive non-symmetric association schemes with 3 classes and at most 100 vertices. Using computer search, we prove non-existence for three feasible parameter sets. Eleven cases are still open. In the imprimitive case, we survey the known results including some constructions of infinite families of schemes. In the smallest case that has been open up t...
متن کاملFour-class skew-symmetric association schemes
Article history: Received 4 November 2009 Available online 19 January 2011
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2007
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2005.07.029